The Gentzen-Kripke construction of the intermediate logic LQ
نویسنده
چکیده
The Gentzen-Kripke construction of the semantics for intermediate logic LQ, which is obtainable from the intuitionistic propositional logic H by adding the weak law of excluded middle -*A v —• —1>4, is presented. Our construction spans the Gentzen system and the Kripke semantics for LQ by providing the way from the cut-elimination theorem to model-theoretic results. The completeness and decidability theorems are shown in this method. / Introduction An intermediate logic LQ is obtainable from the intuitionistic propositional logic H by adding the weak law of excluded middle -\A v -»-vl. The logic can also be axiomatized by the axiom schema (-\A -> -ii?) v (-ιB -> -ιA). The motivation of LQ is purely technical rather than philosophical in that LQ is one possible extension of H. Our interest thus lies in its characterization in relation to the formalization of H. The semantics for LQ can be given by the class of directed Kripke frames; see Gabbay [4]. Several authors also proposed the Gentzen systems for LQ, none of which is successful. For example, the cut-elimination theorem cannot be proved in the sequent calculus of Boricic [2] as Hosoi pointed out. Recently, Hosoi [6] gave a Gentzen-type formulation GQ for LQ and proved the cut-elimination theorem. The purpose of this paper is to develop the Gentzen-Kripke construction of the semantics for LQ using the subformula models, as a modification of the one developed in Akama [1] for intuitionistic predicate logic. The proposed construction spans the Gentzen system and the Kripke semantics for LQ by providing the way from the cut-elimination theorem to model-theoretic results. The completeness and decidability theorems are shown in this method. 2 Intermediate logic LQ and its Gentzen-type formulation GQ The intermediate logic LQ is one of the extensions of the intuitionistic propositional logic H with the weak law of excluded middle, i.e. -*A v -ι-υ4. The proof and model Received July 10, 1989; revised May 7, 1990 CONSTRUCTION OF INTERMEDIATE LOGIC 149 theories for LQ are modified so that the weak law of excluded middle can be accommodated therein. As for model theory, Gabbay [4] presented a directed Kripke model for LQ. For the detailed exposition of a Kripke semantics for intuitionistic logic, the reader is referred to Fitting [3]. In the following, we review a Gentzen-type formulation GQ of LQ as developed by Hosoi [6]. GQ is a variant of LJ due to Gentzen [5] for intuitionistic logic. It requires two additional axioms for beginning sequents:
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملProof theory for admissible rules
The admissible rules of a logic are the rules under which the set of theorems of the logic is closed. In this paper a Gentzen-style framework is introduced for defining analytic proof systems that derive the admissible rules of various non-classical logics. Just as Gentzen systems for derivability treat sequents as basic objects, for admissibility, sequent rules are basic. Proof systems are def...
متن کاملOn Interpolation in Existence Logics
In [2] Gentzen calculi for intuitionistic logic extended with an existence predicate were introduced. Such logics were first introduced by Dana Scott, who provided a proof system for it in Hilbert style. The logic seems particularly useful in settings where non constant domain Kripke models play a role. In this paper it is proved that these systems have interpolation and the Beth definability p...
متن کاملMany-valued modal logics
Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given for both versions, and soundness and compl...
متن کاملForcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-free intuitionistic sequent calculus as formal system and by combining soundness with completeness, we obtain an executable cut-elimination procedure. The proof, which has been formalised in the Coq proof assistant, easi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 33 شماره
صفحات -
تاریخ انتشار 1992